Decompositions of Automata and Transition Semigroups
نویسندگان
چکیده
The purpose of this paper is to describe structural properties of automata whose transition semigroups have a zero, left zero, right zero or bi-zero, or are nilpotent extensions of rectangular bands, left zero bands or right zero bands, or are nilpotent. To describe the structure of these automata we use various well-known decomposition methods of automata theory – direct sum decompositions, subdirect and parallel decompositions, and extensions of automata. Automata that appear as the components in these decompositions belong to some well-known classes of automata, such as directable, definite, reverse definite, generalized definite and nilpotent automata. But, we also introduce some new classes of automata: generalized directable, trapped, onetrapped, locally directable, locally one-trapped, locally nilpotent and locally definite automata. We explain relationships between the classes of all these automata.
منابع مشابه
Automata and semigroups recognizing infinite words
This paper is a survey on the algebraic approach to the theory of automata accepting infinite words. We discuss the various acceptance modes (Büchi automata, Muller automata, transition automata, weak recognition by a finite semigroup, ω-semigroups) and prove their equivalence. We also give two algebraic proofs of McNaughton’s theorem on the equivalence between Büchi and Muller automata. Finall...
متن کاملFinite Aperiodic Semigroups with Commuting Idempotents and Generalizations
Among the most important and intensively studied classes of semigroups are finite semigroups, regular semigroups and inverse semigroups. Finite semigroups arise as syntactic semigroups of regular languages and as transition semigroups of finite automata. This connection has lead to a large and deep literature on classifying regular languages by means of algebraic properties of their correspondi...
متن کاملOn varieties of semigroups and unary algebras∗†
The elementary result of Variety theory is Eilenberg’s Variety theorem which was motivated by characterizations of several families of string languages by syntactic monoids or semigroups, such as Schützenberger’s theorem connecting star-free languages and aperiodic monoids. Eilenberg’s theorem has been extended in various directions. For example, Thérien involved varieties of congruences on fre...
متن کاملAUTOMATE, a Computing Package for Automata and Finite Semigroups
AUTOMATE is a package for symbolic computation on nite automata, extended rational expressions and nite semigroups. On the one hand, it enables one to compute the deterministic minimal automaton of the language represented by a rational expression or given by its table. On the other hand, given the transition table of a deterministic automaton, AUTOMATE computes the associated transition monoid...
متن کاملRepresentation Theory of Finite Semigroups, Semigroup Radicals and Formal Language Theory
In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are given to obtain many new results, as well as easier proofs of several results in the literature, involving: triangularizability of finite semigroups; which sem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Acta Cybern.
دوره 13 شماره
صفحات -
تاریخ انتشار 1998